/*
 * Assignment4.cpp
 *
 *  Created on: Apr 26, 2014
 *      Author: Anthony Varghese
 */

#include <iostream>
#include <string>
#include <vector>
#include <algorithm> // for the for_each function

using std::cout;
using std::endl;
using std::string;
using std::vector;

vector<string> split(string e);

//#include "BinaryExpressionTree.h"
//using Tree::BinaryExpressionTree;

int main(){
	string testExpression = "ax ^ 3 - ( b + c ) * ( 2 + 12.7 ^ ( 5 - 2 ) )";
	cout << "Test expression is: " << testExpression << endl;

	vector<string> testTokens = split( testExpression );

	// Convert the infix expression to a Queue object
//	Queue<string> inputQueue;
//	for (const auto& t : testTokens)
//		inputQueue.add( t );
//	cout << endl << endl;

	// Convert the Queue object to a Binary Expression Tree
//	BinaryExpressionTree tree;
//	tree.convert( inputQueue );

//	tree.print_inorder( cout );
//	tree.print_preorder( cout );
//	tree.print_postorder( cout );

	cout << endl;
	cout << "Done!!" << endl;
}
